Nuprl Lemma : p-mu_wf
11,40
postcript
pdf
P
:(
),
x
:(
+ Top). p-mu(
P
;
x
)
latex
ProofTree
Definitions
,
t
T
,
,
x
:
A
B
(
x
)
,
Top
,
Type
,
left
+
right
,
f
(
a
)
,
x
:
A
.
B
(
x
)
,
b
,
A
,
A
B
,
P
&
Q
,
i
j
<
k
,
{
x
:
A
|
B
(
x
)}
,
{
i
..
j
}
,
#$n
,
x
:
A
B
(
x
)
,
case
b
of inl(
x
) =>
s
(
x
) | inr(
y
) =>
t
(
y
)
,
,
p-mu(
P
;
x
)
Lemmas
int
seg
wf
,
le
wf
,
not
wf
,
assert
wf
,
top
wf
,
nat
wf
,
bool
wf
origin
P:(
), x:( + Top). p-mu(P;x) 
P:(), x:( + Top). p-mu(P;x)
TB(x)x:A. B(x)
b
A
B j < k
}
B(x)